Non-transitive Correspondence Analysis

Abstract The paper’s novelty is in combining two comparatively new fields of research: non-transitive logic and the proof method correspondence analysis. To be more detailed, this paper latter adapted to Weir’s trivalent $${\mathbf{NC}}_{\mathbf{3}}$$ NC 3 . As a result, for each binary extension , we present sound complete Lemmon-style natural deduction system. Last, but not least, stress fact that Avron his co-authors’ general obtaining n -sequent systems any -valent with deterministic or non-deterministic matrices applicable its extensions.